Reduction of the Graph Isomorphism Problem to Equality Checking of n-variables Polynomials and the Algorithms that Use the Reduction

The graph isomorphism problem is considered. We assign modified characteristic polynomials for graphs and reduce the graph isomorphism problem to the following one. It is required to find out, is there such an enumeration of the graphs vertices that the polynomials of the graphs are equal. We present algorithms that use the redution and we show that we may check equality of the graphs polynomials values at specified points without direct evaluation of the values. We give justification of the algorithms and give the scheme of its numerical realization. The example of the approach implementation and the results of computational experiments are presented.